Formulations and Reformulations in Integer Programming

نویسنده

  • Michael A. Trick
چکیده

Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophisticated branch-and-bound codes,is insufficient when using state-of-the-art codes that understand and embed many of the obvious formulation improvements. As these optimization codes become more sophisticated it is important to have finer control over their operation. Modelers need to be even more creative in reformulating their integer programs in order to improve on the automatic reformulations of the optimization codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reformulation and Decomposition of Integer Programs

We examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover reformulations based on decomposition, such as Lagrangean relaxation, the Dantzig-Wolfe reformulation and the resulting column generation ...

متن کامل

Exact Penalty Functions for Nonlinear Integer Programming Problems

Abstract In this work, we study exact continuous reformulations of nonlinear integer programming problems. To this aim, we preliminarily state conditions to guarantee the equivalence between pairs of general nonlinear problems. Then, we prove that optimal solutions of a nonlinear integer programming problem can be obtained by using various exact penalty formulations of the original problem in a...

متن کامل

Comparing ASP, CP, ILP on Wire Routing Problems

We study three declarative programming paradigms, Answer Set Programming (ASP), Constraint Programming (CP), and Integer Linear Programming (ILP) on a challenging application: wire routing. We represent wire routing in each formalism in a systematic way, compare the formulations both from the point of view of knowledge representation (e.g., how tolerant they are to elaborations) and from the po...

متن کامل

Mathematical Programming Models and Formulations for Deterministic Production Planning Problems

We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning problems. The objective is to present the classical optimization approaches used, and the known models, for dealing with such management problems. We describe first production planning models in the general context of manufacturing p...

متن کامل

Solving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming

Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005